Cyclic Codes over Some Finite Quaternion Integer Rings
نویسندگان
چکیده
In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and decoding algorithm for these codes is given. 2000 AMS Classification: 94B05, 94B15, 94B35, 94B60
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملCyclic codes for T-user adder channel over integer rings - Electronics Letters
Coding for the synchronous noiseless T-user real adder channel is considered by employing cyclic codes with symbols from an arbitrary finite integer ring. The code construction is based on the factorisation of Y 1 over the unit ring of an appropriate extension of a finite integer ring. Any number of users in the system can be independently active and the maximum achievable sum rate is 1 (when a...
متن کاملOn self-dual cyclic codes over finite chain rings
Let R be a finite commutative chain ring with unique maximal ideal 〈γ〉, and let n be a positive integer coprime with the characteristic of R/〈γ〉. In this paper, the algebraic structure of cyclic codes of length n over R is investigated. Some new necessary and sufficient conditions for the existence of nontrivial self-dual cyclic codes are provided. An enumeration formula for the self-dual cycli...
متن کاملCyclic Codes over Some Finite Rings
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given. AMS Classification: 94B05, 94B60
متن کاملMinimum Homogeneous Weights of a Class of Cyclic Codes over Primary Integer Residue Rings∗
EXTENDED ABSTRACT. Most of the results in traditional finite-field linear coding theory regarding the minimum distance of linear codes refer to the Hamming metric. Important early exceptions are given by Berlekamp’s nega-cyclic codes (cf. [1]) and Mazur’s [9] low-rate codes, both having interesting properties in terms of the Leemetric. At the beginning of the nineties of the previous century an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0905.4165 شماره
صفحات -
تاریخ انتشار 2009